Analyzing logic programs using “prop”-ositional logic programs and a magic wand
نویسندگان
چکیده
منابع مشابه
Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand
This paper illustrates the role of a class of \prop"-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding \prop"-ositional logic programs which approximate the original programs and have nite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretati...
متن کاملAnalyzing Logic Programs Using \ Prop " -
This paper illustrates the role of a class of \prop"-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding \prop"-ositional logic programs which approximate the original programs and have nite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretati...
متن کاملAbstract Interpretation of Logic Programs using Magic Transformations
Interpretation of Logic Programs Using Magic Transformations Saumya Debray Department of Computer Science, University of Arizona-Tucson, AZ 85721, U.S.A. Raghu Ramakrishnan Department of Computer Sciences, University of Wisconsin-Madison, WI 53706, U.S.A. Abstract In data ow analysis of logic programs, information must be propagated according to the control strategy of the language under consid...
متن کاملAnalyzing Declarative Semantics of Logic Programs
Deductive databases and constraint systems have a transparent declarative semantics, which enables to read and to understand such programs ignoring their execution algorithms. An interactive toolkit, which is aimed at such \understanding", is presented. It enables generation of precise descriptions of the goal-relevant correct answers. Its ultimate goal is a problem-speciic optimization, which ...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1995
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00064-x